منابع مشابه
Solving Maximum Cut Problems by Simulated Annealing
This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compare its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to ...
متن کاملSolving distance problems with concave bodies using simulated annealing
Determining the minimum distance between two convex objects is a problem that has been solved using many di¤erent approaches. Some methods rely on computational geometry techniques, while others rely on optimization techniques to ...nd the solution. Some fast algorithms sacri...ce precision for speed while others are limited in the types of objects that they can handle (e.g. linearly bound obje...
متن کاملSolving Set Cover with Pairs Problem using Quantum Annealing
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schrödinger equation in order to...
متن کاملSolving Highly Constrained Search Problems with Quantum
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satissability problems for which the generalized algorithm can nd a solution in a constant number of steps as the number of variables increases. This performance contrasts with the lin...
متن کاملSolving Random Satisfiability Problems with Quantum Computers
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digitale Welt
سال: 2021
ISSN: 2569-1996
DOI: 10.1007/s42354-021-0341-9